Satisfiability Problems on Sums of Kripke Frames
نویسندگان
چکیده
We consider the operation of sum on Kripke frames, where a family frames-summands is indexed by elements another frame. In many cases, modal logic sums inherits finite model property and decidability from summands [Babenyshev Rybakov 2010 ; Shapirovsky 2018 ]. this paper we show that, under general condition, satisfiability problem polynomial space Turing reducible to summands. particular, for logics in PSpace an immediate corollary semantic characterization logic.
منابع مشابه
Generalized Kripke Frames
Algebraic work [9] shows that the deep theory of possible world semantics is available in the more general setting of substructural logics, at least in an algebraic guise. The question is whether it is also available in a relational form. This article seeks to set the stage for answering this question. Guided by the algebraic theory, but purely relationally we introduce a new type of frames. Th...
متن کاملDefinability in Quantum Kripke Frames
I characterize the first-order definable, bi-orthogonally closed subsets of a quasiquantum Kripke frame satisfying a reasonable assumption. The techniques are generalization of those in Goldblatt’s paper published in 1984. Combining these techniques with Goldblatt’s idea, I prove that quantum Kripke frames are not firstorder definable in the class of quasi-quantum Kripke frames.
متن کاملGeometry in Quantum Kripke Frames
Quantum Kripke frames and other related kinds of Kripke frames are introduced. The inner structures of these Kripke frames are studied in detail, and many of them turn out to form nice geometries. To be precise, geometric frames, which are more general than quantum Kripke frames, correspond to projective geometries with a pure polarity; and quantum Kripke frames correspond to irreducible Hilber...
متن کاملSums of Squares, Satisfiability and Maximum Satisfiability
Recently the Mathematical Programming community showed a renewed interest in Hilbert’s Positivstellensatz. The reason for this is that global optimization of polynomials in IR[x1, . . . , xn] is NPhard, while the question whether a polynomial can be written as a sum of squares has tractable aspects. This is due to the fact that Semidefinite Programming can be used to decide in polynomial time (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2022
ISSN: ['1557-945X', '1529-3785']
DOI: https://doi.org/10.1145/3508068